The multi-integer set cover and the facility terminal cover problem

نویسندگان

  • Dorit S. Hochbaum
  • Asaf Levin
چکیده

The facility terminal cover problem is a generalization of the vertex cover problem. The problem is to “cover” the edges of an undirected graph G = (V, E) where each edge e is associated with a non-negative demand de. An edge e = [u, v] is covered if at least one of its endpoint vertices is allocated capacity of at least de. Each vertex v is associated with a non-negative weight wv. The goal is to allocate capacity cv ≥ 0 to each vertex v so that all edges are covered and the total allocation cost, ∑ v∈V wvcv, is minimized. A recent paper by Xu, Yang and Xu (Networks, 50, (2007), 118-126), studied this problem, and presented a 2eapproximation algorithm for this problem for e the base of the natural logarithm. We generalize here the facility terminal cover problem to the multi-integer set cover, and relate that problem to the set cover problem, which it generalizes, and the multi-cover problem. We present a ∆-approximation algorithm for the multi-integer set cover problem, for ∆ the maximum coverage. This demonstrates that even though the multi-integer set cover problem generalizes the set cover problem, the same approximation ratio holds. In the special case of the facility terminal cover problem this yields a 2-approximation algorithm, and with run time dominated by the sorting of the edge demands. This approximation algorithm improves considerably on the result of Xu, Yang and Xu.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Ordered Gradual Covering Location Problem on a Network

In this paper we develop a network location model that combines the characteristics of ordered median and gradual cover models resulting in the Ordered Gradual Covering Location Problem (OGCLP). The Gradual Cover Location Problem (GCLP) was specifically designed to extend the basic cover objective to capture sensitivity with respect to absolute travel distance. Ordered Median Location problems ...

متن کامل

HIT'nDRIVE: Multi-driver Gene Prioritization Based on Hitting Time

A key challenge in cancer genomics is the identification and prioritization of genomic aberrations that potentially act as drivers of cancer. In this paper we introduce HIT’nDRIVE, a combinatorial method to identify aberrant genes that can collectively influence possibly distant “outlier” genes based on what we call the “random-walk facility location” (RWFL) problem on an interaction network. R...

متن کامل

Automatic QoS-aware Web Services Composition based on Set-Cover Problem

By definition, web-services composition works on developing merely optimum coordination among a number of available web-services to provide a new composed web-service intended to satisfy some users requirements for which a single web service is not (good) enough. In this article, the formulation of the automatic web-services composition is proposed as several set-cover problems and an approxima...

متن کامل

A cross entropy algorithm for continuous covering location problem

Covering problem tries to locate the least number of facilities and each demand has at least one facility located within a specific distance.This paper considers a cross entropy algorithm for solving the mixed integer nonlinear programming (MINLP) for covering location model.The model is solved to determine the best covering value.Also, this paper proposes aCross Entropy (CE) algorithm consider...

متن کامل

Primal-dual RNC approximation algorithms for (multi)-set (multi)-cover and covering integer programs

We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approxima.tion algorithms for the set cover problem and its generalizations. Our algorithms use randomization, and our randomized voting lemmas may be of independent interest. Fast parallel approximation algorithms were known before for set cover [BRS89] [LN93], th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Networks

دوره 53  شماره 

صفحات  -

تاریخ انتشار 2009